A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
نویسندگان
چکیده
منابع مشابه
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimization problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve ...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملAdaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general framework composed of three phases: initialization, intensification and diversification. The initialization phase constructs a feasible initial timetable using a fast greedy heuristic. Then an adaptively combined intensific...
متن کاملA Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling
We give a short description of the solver that ranked third in Track Two of the International Timetabling Competition 2007 (ITC2007). It implements a heuristic approach based on stochastic local search and consists of several modules that were found to be useful in different phases of the solution process. Common to all modules is the consideration of only a subset of the constraints that have ...
متن کاملLocal search and constraint programming for the post enrolment-based course timetabling problem
We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2010
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-010-0202-0